SVA , a tool for analysing shared - variable programs
نویسنده
چکیده
In [6], Roscoe described a prototype compiler that allowed straightforward shared variable programs to be analysed using FDR, by writing a compiler in its CSPM language. This allowed, for example, a high degree of control over atomicity but lacked a proper input language and an interpreter for and counter-examples found. In this paper, we first propose a concrete syntax for the input language, and then describe a GUI which takes this as input, drives a modified compiler and FDR, and then provides a clear explanation of counter-examples in suitable format for users of the language.
منابع مشابه
Compiling shared variable programs into CSP
We present a compiler from a simple shared variable language into CSP. This allows the application of CSP-based tools such as FDR when analysing programs written in the other language. The translation into CSP makes it easy to be flexible about the semantics of execution, most particularly the amount of atomicity that is enforced. We examine ways available to translate specifications we may wis...
متن کاملRATCOP: Relational Analysis Tool for Concurrent Programs
In this paper, we present RATCOP, a static analysis tool for efficiently computing relational invariants in race free shared-variable multi-threaded Java programs. The tool trades the standard sound-at-all-program-points guarantee for gains in efficiency. Instead, it computes sound facts for a variable only at program points where it is ”relevant”. In our experiments, RATCOP was fairly precise ...
متن کاملMapping SVA to PSL
Note that local variables and first match are not in the domain of the mapping. Throughout, “unclocked SVA sequence” means “unclocked SVA sequence without local variables or first match”. Similarly, “clocked SVA sequence” means “clocked SVA sequence without local variables or first match”. In the following abstract grammars, b denotes a boolean expression, v denotes a local variable name, and e...
متن کاملAnalysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPlib [4]. Unlike other parallel profiling tools, the architecture independent metric of imbalance in size of communicated data is used to guide program optimisation. We show that by using this metric, BSPlib programs can be optimised in a portable and ...
متن کاملSVA and PSL Local Variables - A Practical Approach
SystemVerilog Assertions (SVA), as well as Property Specification Language (PSL) are linear temporal logics based on LTL [14], extended with regular expressions and local variables. In [6] Bustan and Havlicek show that the local variable extensions, as well as regular expressions with intersection, render the verification problem of SVA and PSL formulae EXPSPACE-complete. In this paper we show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007